Nuprl Lemma : valid-sys-dcdr_wf 11,40

es:ES, Config:AbsInterface(chain_config()), Cmd:Type, Sys:AbsInterface(chain_sys(Cmd)).
valid-sys-dcdr{i:l}(es;Config;Cmd;Sys e:EDec(((e  Sys)) c valid-sys(es;Config;Sys;e)) 
latex


Definitionss = t, t  T, x:AB(x), x:AB(x), ES, chain_config(), AbsInterface(A), Type, chain_sys(Cmd), valid-sys-dcdr{i:l}(es;Config;Cmd;Sys), a:A fp B(a), strong-subtype(A;B), P  Q, , E, b, valid-sys(es;Config;Sys;e), x:A  B(x), A c B, Dec(P), e  X, decidable valid-sys, f(a), {x:AB(x)} , E(X), left + right, let x,y = A in B(x;y), t.1, case b of inl(x) => s(x) | inr(y) => t(y), if b then t else f fi , , Id, (e <loc e'), inr x , "$token", type List, X(e), ccpred?(x), inl x , Atom, Top, loc(e), P & Q, A, x.A(x), xt(x), e<e'P(e), ccpred-id(x), e<e'.P(e), ccsucc?(x), cctail?(x), P  Q, cchead?(x), Unit, ff, tt, False, True, EqDecider(T), IdLnk, EOrderAxioms(Epred?info), EState(T), Knd, x,yt(x;y), kindcase(ka.f(a); l,t.g(l;t) ), Msg(M), , , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), e < e', r  s, constant_function(f;A;B), loc(e), kind(e), SWellFounded(R(x;y)), pred!(e;e'), Void, x:A.B(x), S  T, suptype(ST), first(e), <ab>, pred(e)
Lemmasdecidable valid-sys, kind wf, loc wf, first wf, pred! wf, strongwellfounded wf, constant function wf, qle wf, cless wf, val-axiom wf, rationals wf, nat wf, Msg wf, kindcase wf, Knd wf, EState wf, EOrderAxioms wf, IdLnk wf, deq wf, true wf, false wf, btrue wf, bfalse wf, unit wf, bool wf, cchead? wf, cctail? wf, ccsucc? wf, existse-before wf, ccpred-id wf, pi1 wf, alle-lt wf, es-locl wf, not wf, ccpred? wf, es-interface-val wf2, es-loc wf, top wf, Id wf, es-E-interface wf, subtype rel wf, es-is-interface wf, valid-sys wf, assert wf, decidable wf, es-E wf, member wf, chain sys wf, es-interface wf, chain config wf, event system wf

origin